Noisy-Interference Sum-Rate Capacity for Vector Gaussian Interference Channels
نویسندگان
چکیده
منابع مشابه
A New Outer Bound and the Noisy-Interference Sum-Rate Capacity for Gaussian Interference Channels
A new outer bound on the capacity region of Gaussian interference channels is developed. The bound combines and improves existing genie-aided methods and is shown to give the sum-rate capacity for noisy interference as defined in this paper. Specifically, it is shown that if the channel coefficients and power constraints satisfy a simple condition then single-user detection at each receiver is ...
متن کاملOn the Achievable Rate Sum for Symmetric Gaussian Interference Channels
We compute the exact rate sum of a symmetric Gaussian interference channel for the HanKobayashi region with Gaussian signaling for a subset of parameters in the weak interference regime. In this subset we identify three regimes of operation: an initial set where treating interference as noise is optimal, an intermediate regime where one employs a time-sharing strategy (with power control) betwe...
متن کاملSum Capacity of Degraded Gaussian Interference Networks
This paper determines the sum-capacity of degraded Gaussian K-user interference channels (IFCs). To this end, the paper first develops a family of genie-MAC (multiple access channel) outer bounds for Gaussian K-user interference channels. This family is based on existing genie-aided bounding mechanisms, but differs from current approaches in its optimization problem formulation and application....
متن کاملMaximizing Sum Rates in Gaussian Interference-limited Channels
We study the problem of maximizing sum rates in Gaussian interferencelimited channels. We show that this maximum problem can be restated as a maximization problem of a convex function on a closed convex set. We suggest three algorithms to find the exact and approximate values of the optimal rates.
متن کاملOn Gaussian Interference Channels with mixed interference
This work analyzes a particular achievable region for Gaussian interference channels (IFC) derived from the general Han-Kobayashi region. By reformulating the Han-Kobayashi achievable region as the sum of two sets, we characterize the maximum achievable sum-rate with Gaussian inputs and without timesharing in closed from for any Gaussian IFC. We then show that the computed sum-rate meets the up...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2013
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2012.2216502